Session C6.2 12th Canadian Conference on Computational Geometry

15 Session C4 12th Canadian Conference on Computational Geometry

Session C 3 . 1 12 th Canadian Conference on Computational Geometry Computing Cut Numbers

1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved

This paper studies three-dimensional orthogonal box-drawings where edge-routes have at most one bend. Two open problems for such drawings are: (1) Does every drawing of Kn have volume Ω(n )? (2) Is there a drawing of Kn for which additionally the vertices are represented by cubes with surface O(n)? This paper answers both questions in the negative, and provides related results concerning volume...

C 5 . 2 12 th Canadian Conference on Computational Geometry The Area Partitioning

K-Guarding Polygons on the Plane

Let P be a simple polygon with n vertices. We say that P is k-guardable if it is possible to find a set of points Q consisting of interior points of edges of P such that every point of P is visible from at least k elements in Q and no edge of P has more than one element in Q. The following question was asked by A. Lubiw at the open problem session of the Fourth Canadian Conference in Computatio...